\hypertarget{namespace_introduction_to_algorithm_1_1_set_algorithm}{}\section{Introduction\+To\+Algorithm\+:\+:Set\+Algorithm Namespace Reference}
\label{namespace_introduction_to_algorithm_1_1_set_algorithm}\index{Introduction\+To\+Algorithm\+::\+Set\+Algorithm@{Introduction\+To\+Algorithm\+::\+Set\+Algorithm}}


Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_set_algorithm}{Set\+Algorithm}.  


\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node}{Disjoint\+Set\+Node}
\begin{DoxyCompactList}\small\item\em Disjoint\+Set\+Node：不相交集合森林的节点，算法导论第21章21.3节 \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_set_algorithm}{Set\+Algorithm}. 

该命名空间内包含所有{\ttfamily Set}算法 